Optimal Voronoi diagram construction with convex sites in three dimensions
نویسندگان
چکیده
Lee and Drysdale [13] and Sharir [16] have given suboptimal algorithms for computing the Voronoi diagrams of line-segments or discs in the plane. This paper adapts their methods to constructing the Voronoi diagram for disjoint convex sites in three dimensions. Let be an upper bound on the number of features in any diagram involving sites in three dimensions. Even for point sites, is , so it is reasonable to assume that is monotonically nondecreasing. Under this assumption, our construction with sites takes optimal time . Results of Aurenhammer’s [3] and Chazelle’s [9] show that if the sites are spherical then the diagram can be constructed in time , but has yet to be determined for more general classes of site. The sites are assumed to be compact and semi-algebraic of bounded algebraic complexity. For the sake of simplicity we assume that the sites are strictly convex and rounded (having no sharp corners nor edges). Assuming strict convexity simplifies the analysis, as does the roundedness assumption, though the latter is neither necessary nor restrictive.
منابع مشابه
Planning a Purely Translational Motion for a Convex Object in Two-Dimensional Space Using Generalized Voronoi Diagrams
Generalized Voronoi diagrams of objects are di cult to compute in a robust way, especially in higher dimensions. For a number of applications an approximation of the real diagram within some predetermined precision is su cient. In this paper we study the computation of such approximate Voronoi diagrams. The emphasis is on practical applicability, therefore we are mainly concerned with fast (in ...
متن کاملLocal differentiability and monotonicity properties of Voronoi diagrams for disjoint convex sites in three dimensions
This paper studies local properties of Voronoi diagrams of sets of disjoint compact convex sites in R. It is established that bisectors are C surfaces and trisectors are C curves, and that as a point moves along a trisector its clearance sphere develops monotonically (Lemma 2.4). This monotonicity property is useful in establishing the existence of Voronoi vertices bounding edges in certain sit...
متن کاملBottleneck Partial-Matching Voronoi Diagrams and Applications
Given two point sets in the plane, we study the minimization of the bottleneck distance between a point set B and an equallysized subset of a point set A under translations. We relate this problem to a Voronoi-type diagram and derive polynomial bounds for its complexity that are optimal in the size of A. We devise efficient algorithms for the construction of such a diagram and its lexicographic...
متن کاملPolygonal Approximation of Voronoi Diagrams of a Set of Triangles in Three Dimensions
We describe a robust adaptive marching tetrahedra type algorithm for constructing a polygonal approximation of the Voronoi Diagram of an arbitrary set of triangles in three dimensions. Space is adaptively subdivided into a set of tetrahedral cells, and the set of Voronoi regions which intersect each cell is determined exactly using a simple primitive we introduce. We obtain a small number of di...
متن کاملVoronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function
The concept of convex polygon-offset distance function was introduced in 2001 by Barequet, Dickerson, and Goodrich. Using this notion of point-to-point distance, they showed how to compute the corresponding nearestand farthest-site Voronoi diagram for a set of points. In this paper we generalize the polygon-offset distance function to be from a point to any convex object with respect to an m-si...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004